The Elliptic Curve Cryptosystem
نویسنده
چکیده
The Elliptic Curve Cryptosystem (ECC) provides the highest strength-per-bit of any cryptosystem known today. This paper provides an overview of the three hard mathematical problems which provide the basis for the security of publickey cryptosystems used today: the integer factorization problem (IFP), the discrete logarithm problem (DLP), and the elliptic curve discrete logarithm problem (ECDLP). An overview of current hardware and software attacks on ECDLP is also provided.
منابع مشابه
A NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملA Fast Elliptic Curve Cryptosystem LSI Embedding Word-Based Montgomery Multiplier
Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an ellip...
متن کاملUcl Crypto Group Technical Report Series Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams
At Eurocrypt'96, Meyer and M uller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Williams-Rabin.
متن کاملA Modified Menezes-Vanstone Elliptic Curve Multi-Keys Cryptosystem
This paper proposes a new modified variant of Menezes and Vanstone elliptic curve cryptosystem. This new variant uses the same original Menezes and Vanstone elliptic curve cryptosystem but in an elegant way. The new variant uses a not only one elliptic curve but a number of curves. Each curve is chosen with its corresponding keys to constitute a separate cryptosystem. The message is then divide...
متن کاملA New Secure and Efficient Elliptic Curve Cryptosystem
The design of new elliptic curve cryptosystem is still an interest to community of cryptographers. In this article, we propose a new secure and efficient elliptic curve cryptosystem. The scheme requires a single public and private keys and needs 59 and 30 for encryption and decryption algorithm respectively. The communication costs is given by 2| |. The estimated computational speed for the enc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997